منابع مشابه
Near-optimal Binary Compressed Sensing Matrix
Compressed sensing is a promising technique that attempts to faithfully recover sparse signal with as few linear and nonadaptive measurements as possible. Its performance is largely determined by the characteristic of sensing matrix. Recently several zero-one binary sensing matrices have been deterministically constructed for their relative low complexity and competitive performance. Considerin...
متن کاملNear Optimal Compressed Sensing Without Priors
Both theoretical analysis and empirical evidence confirm that the approximate message passing (AMP) algorithm can be interpreted as recursively solving a signal denoising problem: at each AMP iteration, one observes a Gaussian noise perturbed original signal. Retrieving the signal amounts to a successive noise cancellation until the noise variance decreases to a satisfactory level. In this pape...
متن کاملAdaptive Compressed Sensing MRI
INTRODUCTION Most of the prior work in compressed sensing MRI has been based on pre-defined transformations to sparsify image representations, e.g. discrete cosine transforms (DCT), wavelets, and finite differences [1]. Even though an analytical transformation usually features a fast implementation, its performance as a sparsifying transform is limited by the underlying basis functions, which t...
متن کاملAdaptive Distributed Compressed Video Sensing
Compressed sensing is a state-of-the-art technology which can significantly reduce the number of sampled data in sparse signal acquisition. This paper studies the distributed compressed sensing (DISCOS) of video signals. To this end, we propose adaptive adjustments to the block-based (local) measurement rate, the frame-based (global) measurement rate, and the sparse dictionary size, thus formin...
متن کاملCompressed Sensing with Sparse Binary Matrices: Instance Optimal Error Guarantees in Near-Optimal Time
A compressed sensing method consists of a rectangular measurement matrix, M ∈ R m×N with m ≪ N , together with an associated recovery algorithm, A : R → R . Compressed sensing methods aim to construct a high quality approximation to any given input vector x ∈ R using onlyMx ∈ R as input. In particular, we focus herein on instance optimal nonlinear approximation error bounds for M and A of the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2321552